Decisive creatures and large continuum

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decisive creatures and large continuum

A. For f > g ∈ ω let c∀f ,g be the minimal number of uniform trees with g-splitting needed to ∀-cover the uniform tree with f -splitting. c∃f ,g is the dual notion for the ∃ cover. Assuming CH and given א1 many (sufficiently different) pairs ( f2 , g2 ) and cardinals κ2 such that κ0 2 = κ2 , we construct a partial order forcing that c∃f2 ,g2 = c ∀ f2 ,g2 = κ2 . For this, we introduce a c...

متن کامل

. L O ] 4 J an 2 00 6 DECISIVE CREATURES AND LARGE CONTINUUM

be the minimal number of uniform trees with g-splitting needed to ∀ ∞-cover a uniform tree with f-splitting. c ∃ f ,g is the dual notion for the ∃ ∞-cover. Assuming CH and given ℵ 1 many (sufficiently different) pairs (f ǫ , g ǫ) and cardinals κ ǫ such that κ ℵ 0 ǫ = κ ǫ , we construct a partial order forcing that c ∃ fǫ ,gǫ = c ∀ fǫ ,gǫ = κ ǫ. For this, we introduce a countable support semipro...

متن کامل

Large Continuum, Oracles Sh895

Our main theorem is about iterated forcing for making the continuum larger than ℵ 2. We present a generalization of [Sh:669] which dealt with oracles for random, (also for other cases and generalities), by replacing ℵ 1 , ℵ 2 by λ, λ + (starting with λ = λ <λ > ℵ 1). Well, we demand absolute c.c.c. So we get, e.g. the continuum is λ + but we can get cov(meagre) = λ and we give some applications...

متن کامل

Countable support iterations and large continuum

We prove that any countable support iteration formed with posets with ω2-p.i.c. has ω2-c.c., assuming CH in the ground model. This improves earlier results of Shelah by removing the restriction on the length of the iteration. Thus, we solve the problem of obtaining a large continuum via such forcing iterations.

متن کامل

Continuum modeling of large networks

This paper is concerned with the modeling and simulation of extremely large networks. We derive a timedependent diffusion–convection partial differential equation, the solution of which captures the global characteristics of a stochastic network model. Continuum modeling provides a powerful way to deal with the number of components in large networks and opens up the use of highly sophisticated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 2009

ISSN: 0022-4812,1943-5886

DOI: 10.2178/jsl/1231082303